An MINLP model to support the movement and storage decisions of the Indian food grain supply chain

This paper addresses the novel three stage food grain distribution problem of Public Distribution System (PDS) in India which comprises of farmers, procurement centers, base silos and field silos. The Indian food grain supply chain consists of various activities such as procurement, storage, transportation and distribution of food grain. In order to curb transportation and storage losses of food grain, the Food Corporation of India (FCI) is moving towards the modernized bulk food grain supply chain system. This paper develops a Mixed Integer Non-Linear Programming (MINLP) model for planning the movement and storage of food grain from surplus states to deficit states considering the seasonal procurement, silo capacity, demand satisfaction and vehicle capacity constraints. The objective function of the model seeks to minimize the bulk food grain transportation, inventory holding, and operational cost. Therein, shipment cost contains the fixed and variable cost, inventory holding and operational cost considered at the procurement centers and base silos. The developed mathematical model is computationally complex in nature due to nonlinearity, the presence of numerous binary and integer variables along with a huge number of constraints, thus, it is very difficult to solve it using exact methods. Therefore, recently developed, Hybrid Particle-Chemical Reaction Optimization (HP-CRO) algorithm has been employed to solve the MINLP model. Different problem instances with growing complexities are solved using HP-CRO and the results are compared with basic Chemical Reaction Optimization (CRO) and Particle Swarm Optimization (PSO) algorithms. The results of computational experiments illustrate that the HP-CRO algorithm is competent enough to obtain the better quality solutions within reasonable computational time

Two stage Indian food grain supply chain network transportation-allocation model

This paper investigates the food grain supply chain, transportation allocation problem of Indian Public Distribution System (PDS). The different activities of Indian food grain supply chain are procurements, storage, movement, transportation and distribution. We have developed a mixed integer nonlinear programming model (MINLP) to minimize the transportation, inventory and operational cost of shipping food grains from the cluster of procurement centers of producing states to the consuming state warehouses. A recently developed chemical reaction optimization (CRO) algorithm is used for testing the model which gives the superior computational performance compared to other metaheuristics

Efficient two-dimensional magnetotellurics modelling using implicitly restarted Lanczos method

This paper presents an efficient algorithm, FDA2DMT (Free Decay Analysis for 2D Magnetotellurics (MT)), based on eigenmode approach to solve the relevant partial differential equation, for forward computation of two-dimensional (2D) responses. The main advantage of this approach lies in the fact that only a small subset of eigenvalues and corresponding eigenvectors are required for satisfactory results. This small subset (pre-specified number) of eigenmodes are obtained using shift and invert implementation of Implicitly Restarted Lanczos Method (IRLM). It has been established by experimentation that only 15-20% smallest eigenvalue and corresponding eigenvectors are sufficient to secure the acceptable accuracy. Once the single frequency response is computed using eigenmode approach, the responses for subsequent frequencies can be obtained in negligible time. Experiment design results for validation of FDA2DMT are presented by considering two synthetic models from COMMEMI report, Brewitt-Taylor and Weaver (1976) model and a field data based model from Garhwal Himalaya

Risk Assessment in the Formation of Virtual Enterprises

Abstract. A Virtual Enterprise (VE) is considered as a temporary consortium of member enterprises formed to pool their core competencies and exploit the market opportunities. Although a VE has many phases, such as business opportunity identification, formation and partner selection, operation and dissolution. The partner selection phase is considered to be of the utmost importance and care should be taken to assess all the risk factors. This paper examines the partner selection problem by considering three types of risks, individual performance risk, collaborative performance risk and network risk. Based on the information provided by the potentially collaborating enterprises, a mathematical model has been developed for calculation of all three types of risks

Bulk wheat transportation and storage problem of public distribution system

This research investigates the multi-period multi-modal bulk wheat transportation and storage problem in a two-stage supply chain network of Public Distribution System (PDS). The bulk transportation and storage can significantly curtail the transit and storage losses of food grains, which leads to substantial cost savings. A mixed integer non-linear programming model (MINLP) is developed after studying the Indian wheat supply chain scenario, where the objective is to minimize the transportation, storage and operational cost of the food grain incurred for efficient transfer of wheat from producing states to consuming states. The cost minimization of Indian food grain supply chain is a very complex and challenging problem because of the involvement of the many entities and their constraints such as seasonal procurement, limited scientific storages, varying demand, mode of transportation and vehicle capacity constraints. To address this complex and challenging problem of food grain supply chain, we have proposed the novel variant of Chemical Reaction Optimization (CRO) algorithm which combines the features of CRO and Tabu search (TS) and named it as a hybrid CROTS algorithm (Chemical reaction optimization combined with Tabu Search). The numerous problems with different sizes are solved using the proposed algorithm and obtained results have been compared with CRO. The comparative study reveals that the proposed CROTS algorithm offers a better solution in less computational time than CRO algorithm and the dominance of CROTS algorithm over the CRO algorithm is demonstrated through statistical analysis

Application of Biosorption for Removal of Heavy Metals from Wastewater

Fresh water accounts for 3% of water resources on the Earth. Human and industrial activities produce and discharge wastes containing heavy metals into the water resources making them unavailable and threatening human health and the ecosystem. Conventional methods for the removal of metal ions such as chemical precipitation and membrane filtration are extremely expensive when treating large amounts of water, inefficient at low concentrations of metal (incomplete metal removal) and generate large quantities of sludge and other toxic products that require careful disposal. Biosorption and bioaccumulation are ecofriendly alternatives. These alternative methods have advantages over conventional methods. Abundant natural materials like microbial biomass, agro-wastes, and industrial byproducts have been suggested as potential biosorbents for heavy metal removal due to the presence of metal-binding functional groups. Biosorption is influenced by various process parameters such as pH, temperature, initial concentration of the metal ions, biosorbent dose, and speed of agitation. Also, the biomass can be modified by physical and chemical treatment before use. The process can be made economical by regenerating and reusing the biosorbent after removing the heavy metals. Various bioreactors can be used in biosorption for the removal of metal ions from large volumes of water or effluents. The recent developments and the future scope for biosorption as a wastewater treatment option are discussed

Grain silo location-allocation problem with dwell time for optimization of food grain supply chain network.

In the last few decades, production and procurement of food grain in India have steadily increased, however, storage capacity has not increased proportionally. The government of India (GOI) is establishing the various capacitated silos across the country to bridge this storage capacity gap. This paper presents a novel integrated multi-objective, multi-modal and multi-period mathematical model for grain silo location-allocation problem with Dwell time to support the decision-making process of GOI. Two conflicting objectives-minimization of total supply chain network cost and total lead time (transit and dwell time) are simultaneously optimized using two Pareto based multi-objective algorithms with calibrated parameters

Green food supply chain design considering risk and post-harvest losses: a case study

The global food insecurity, malnourishment and rising world hunger are the major hindrances in accomplishing the zero hunger sustainable development goal by 2030. Due to the continuous increment of wheat production in the past few decades, India received the second rank in the global wheat production after China. However, storage capacity has not been expanded with similar extent. The administrative bodies in India are constructing several capacitated silos in major geographically widespread producing and consuming states to curtail this gap. This paper presents a multi-period single objective mathematical model to support their decision-making process. The model minimizes the silo establishment, transportation, food grain loss, inventory holding, carbon emission, and risk penalty costs. The proposed model is solved using the variant of the particle swarm optimization combined with global, local and near neighbor social structures along with traditional PSO. The solutions obtained through two metaheuristic algorithms are compared with the optimal solutions. The impact of supply, demand and capacity of silos on the model solution is investigated through sensitivity analysis. Finally, some actionable theoretical and managerial implications are discussed after analysing the obtained results

CONSTRUCTING AN VIRTUAL MIXED FIELD FOR STREAMING REQUIREMENTS

Due to complexity of programs that works on wireless systems, quality of assurance over these systems has acquired attention. Wireless sensor systems have to be proficient to deal with several programs on similar platform. We intend at improving the reliability to find the best reliability programs minimizing finish-to-finish delay for delay sensitive ones, still when network comes. We practice a mechanism that allows the packets of delay attentive to move all along least path additionally to packets by reliability must prevent promising losing on hotspots. We setup integrity and delay differentiated routing method that's a multi-path dynamic routing method. Recommended system will separate packets of programs by means of separate needs and services information quality in relation to weight designated to every packet, and direct them toward sink completely through various pathways to acquire better data reliability for your programs of integrity sensitive. It'll present high-quality scalability since only local particulars are essential that simplifies performance

TOUR PACKAGE PROPOSAL BASED ON USER INTERESTS IN ONLINE SOCIAL MEDIA

Location message still from peripatetic users, wittingly and unconsciously, can concede way over only a user’s ordinate and abscissa. Within this report, we survey bordering k nearest adjoin queries whither the peripatetic user queries the neighborhood positioned firm through bordering k nearest sights occupying on his stream whereabouts. To weigh the assurance in our solutions, we construe a safecracker create web hosting in queries. The security reasoning has proven our solutions ensures both scene penetralium sense the user doesn't expose any fine points roughly his neighborhood to the LBS worker and interrogate separateness spirit the user doesn't expose whichever kind of POIs he's excited to the LBS worker. We consider that the mobile user can buy his position from satellites unnamed, and the central administration and the LBS laborer taboo plot to involve the user scene concealment or competent is an unnamed siphon. RSA isn't a probabilistic file encryption plan. To transform RSA to some probabilistic file encryption plan, we behoove then add indiscriminate bits worldly the theme m previously encrypting m with RSA. The ambition of deed this enjoy approving that the peripatetic user can achieve just one in POIs per quiz. Additionally, when the locomotive user can have a chain of encrypted k nearest POIs in reach the reply in the LBS assistant, he incurs time and again run the RR form just with the LBS waiter to purchase a progression of k nearest POIs on the outside precondition of quiz crop and return step. Performance has proven our law contract performs much well than PIR planted LBS enquire obligations when it comes to both complementary reckoning and information overhead